/*
 * @lc app=leetcode.cn id=866 lang=javascript
 *
 * [866] 回文素数
 */

// @lc code=start
/**
 * @param {number} n
 * @return {number}
 */
var primePalindrome = function (n) {
  let arr = [2, 3, 5, 7, 11, 101, 131, 181, 313, 373, 727, 787, 919, 10301,
    10601, 11411, 12721, 13331, 13931, 14741, 30203, 70207, 70607, 98689, 1003001,
    1218121, 1444441, 1643461, 1879781, 3075703, 3293923, 3515153, 3769673, 3994993,
    7257527, 7521257, 7782877, 9024209, 9286829, 9604069, 9822289, 9935399,
    9957599, 9978799, 9981899, 100030001, 133020331];
  for (let i = 0; i < arr.length; i++) {
    if (arr[i] >= n) return arr[i];
  }
};
// @lc code=end

